On the Asymptotic Behavior of Fuzzy Cellular Automata
نویسندگان
چکیده
منابع مشابه
On the Asymptotic Behavior of Fuzzy Cellular Automata
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification” of the local rule of a corresponding Boolean cellular automaton in disjunctive normal form. In this paper we consider circular FCA; their asymptotic behavior has been observed through simulations and FCA have been empirically classified accordingly. No analytical study exists so...
متن کاملOn the Asymptotic Behaviour of Circular Fuzzy Cellular Automata
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification” of the local rule of a corresponding Boolean cellular automaton in disjunctive normal form. In this paper, we consider circular FCA; their asymptotic behaviours had previously been observed through simulation and FCA had been empirically classified accordingly. However, no analy...
متن کاملAsymptotic Behavior of Excitable Cellular Automata
This research was partially supported by research grants to each of the authors from the National Science Foundation We study two families of excitable cellular automata known as the Greenberg–Hastings model and the cyclic cellular automaton. Each family consists of local deterministic oscillating lattice dynamics, with parallel discrete-time updating, parametrized by the range of interaction, ...
متن کاملAsymptotic Behavior and ratios of Complexity in Cellular Automata
We study the asymptotic behaviour of symbolic computing systems, notably one-dimensional cellular automata (CA), in order to ascertain whether and at what rate the number of complex versus simple rules dominate the rule space for increasing neighbourhood range and number of symbols (or colours), and how different behaviour is distributed in the spaces of different cellular automata formalisms. ...
متن کاملFuzzy Evolutionary Cellular Automata
Genetic algorithms are powerful tools that allow engineers and scientists to find good solutions to hard computational problems using evolutionary principles. The classic genetic algorithm has several disadvantages, however. Foremost among these drawbacks is the difficulty of choosing optimal parameter settings. Genetic algorithm literature is full of empirical tricks, techniques, and rules of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2009
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2009.09.012